On Compact Symmetric Regularizations of Graphs

On Compact Symmetric Regularizations of Graphs

Let G be a finite simple graph of order n, maximum degree ∆, and minimum degree δ. A compact regularization of G is a ∆-regular graph H of which G is an induced subgraph: H is symmetric if every automorphism of G can be extended to an automorphism of H. The index |H : G| of a regularization H of G is the ratio |V (H)|/|V (G)|. Let mcr(G) denote the index of a minimum compact regularization of G...

PT −symmetric regularizations in supersymmetric quantum mechanics

Within the supersymmetric quantum mechanics the necessary regularization of the poles of the superpotentials on the real line of coordinates x may be most easily mediated by a small constant shift of this axis into complex plane. Detailed attention is paid here to the resulting recipe which works, in effect, with non-Hermitian (a. k. a. PT −symmetric or pseudo-Hermitian) Hamiltonians. Besides a...

Classifying pentavalnet symmetric graphs of order $24p$

A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.

Cubic symmetric graphs of orders $36p$ and $36p^{2}$

A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

A Poisson Structure on Compact Symmetric Spacesphilip